package com.zhl.algirithm1;

import java.util.Arrays;

public class Test1 {
    public static void main(String[] args) {
        //冒号排序
        int[] arr = {131,127,13,21,113,107,103,101,23,7};
        int n = arr.length;
        for (int i = 0; i < n - 1; i++) {
            for(int j =0; j< n-i-1;j++){
                if(arr[j] > arr[j+1]){
                    int temp = arr[j];
                    arr[j] = arr[j+1];
                    arr[j+1] = temp;
                }
            }

        }
        System.out.println("冒泡排序后：" + Arrays.toString(arr));

    }
}
